TSTP Solution File: QUA002^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : QUA002^1 : TPTP v8.1.2. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n006.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun May 5 08:50:54 EDT 2024
% Result : Theorem 0.15s 0.40s
% Output : Refutation 0.15s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : QUA002^1 : TPTP v8.1.2. Released v4.1.0.
% 0.10/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.15/0.35 % Computer : n006.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Fri May 3 17:07:23 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.15/0.35 This is a TH0_THM_EQU_NAR problem
% 0.15/0.36 Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/tmp/tmp.LDamrgVHn1/Vampire---4.8_24398
% 0.15/0.38 % (24569)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on Vampire---4 for (2999ds/183Mi)
% 0.15/0.38 % (24572)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on Vampire---4 for (2999ds/2Mi)
% 0.15/0.38 % (24572)Instruction limit reached!
% 0.15/0.38 % (24572)------------------------------
% 0.15/0.38 % (24572)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.38 % (24572)Termination reason: Unknown
% 0.15/0.38 % (24572)Termination phase: Property scanning
% 0.15/0.38
% 0.15/0.38 % (24572)Memory used [KB]: 895
% 0.15/0.38 % (24572)Time elapsed: 0.003 s
% 0.15/0.38 % (24572)Instructions burned: 2 (million)
% 0.15/0.38 % (24572)------------------------------
% 0.15/0.38 % (24572)------------------------------
% 0.15/0.39 % (24570)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on Vampire---4 for (2999ds/4Mi)
% 0.15/0.39 % (24574)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on Vampire---4 for (2999ds/275Mi)
% 0.15/0.39 % (24575)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on Vampire---4 for (2999ds/18Mi)
% 0.15/0.39 % (24573)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on Vampire---4 for (2999ds/2Mi)
% 0.15/0.39 % (24571)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on Vampire---4 for (2999ds/27Mi)
% 0.15/0.39 % (24576)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on Vampire---4 for (2999ds/3Mi)
% 0.15/0.39 % (24573)Instruction limit reached!
% 0.15/0.39 % (24573)------------------------------
% 0.15/0.39 % (24573)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (24573)Termination reason: Unknown
% 0.15/0.39 % (24573)Termination phase: Property scanning
% 0.15/0.39
% 0.15/0.39 % (24573)Memory used [KB]: 1023
% 0.15/0.39 % (24573)Time elapsed: 0.004 s
% 0.15/0.39 % (24573)Instructions burned: 2 (million)
% 0.15/0.39 % (24573)------------------------------
% 0.15/0.39 % (24573)------------------------------
% 0.15/0.39 % (24574)Refutation not found, incomplete strategy
% 0.15/0.39 % (24574)------------------------------
% 0.15/0.39 % (24574)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (24574)Termination reason: Refutation not found, incomplete strategy
% 0.15/0.39
% 0.15/0.39
% 0.15/0.39 % (24574)Memory used [KB]: 5500
% 0.15/0.39 % (24574)Time elapsed: 0.004 s
% 0.15/0.39 % (24574)Instructions burned: 2 (million)
% 0.15/0.39 % (24574)------------------------------
% 0.15/0.39 % (24574)------------------------------
% 0.15/0.39 % (24576)Instruction limit reached!
% 0.15/0.39 % (24576)------------------------------
% 0.15/0.39 % (24576)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (24576)Termination reason: Unknown
% 0.15/0.39 % (24576)Termination phase: Function definition elimination
% 0.15/0.39
% 0.15/0.39 % (24576)Memory used [KB]: 1023
% 0.15/0.39 % (24576)Time elapsed: 0.005 s
% 0.15/0.39 % (24576)Instructions burned: 3 (million)
% 0.15/0.39 % (24576)------------------------------
% 0.15/0.39 % (24576)------------------------------
% 0.15/0.39 % (24570)Instruction limit reached!
% 0.15/0.39 % (24570)------------------------------
% 0.15/0.39 % (24570)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (24570)Termination reason: Unknown
% 0.15/0.39 % (24570)Termination phase: Property scanning
% 0.15/0.39
% 0.15/0.39 % (24570)Memory used [KB]: 1023
% 0.15/0.39 % (24570)Time elapsed: 0.006 s
% 0.15/0.39 % (24570)Instructions burned: 4 (million)
% 0.15/0.39 % (24570)------------------------------
% 0.15/0.39 % (24570)------------------------------
% 0.15/0.39 % (24571)Refutation not found, incomplete strategy
% 0.15/0.39 % (24571)------------------------------
% 0.15/0.39 % (24571)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (24571)Termination reason: Refutation not found, incomplete strategy
% 0.15/0.39
% 0.15/0.39
% 0.15/0.39 % (24571)Memory used [KB]: 5500
% 0.15/0.39 % (24571)Time elapsed: 0.010 s
% 0.15/0.39 % (24571)Instructions burned: 7 (million)
% 0.15/0.39 % (24571)------------------------------
% 0.15/0.39 % (24571)------------------------------
% 0.15/0.40 % (24575)First to succeed.
% 0.15/0.40 % (24569)Also succeeded, but the first one will report.
% 0.15/0.40 % (24575)Refutation found. Thanks to Tanya!
% 0.15/0.40 % SZS status Theorem for Vampire---4
% 0.15/0.40 % SZS output start Proof for Vampire---4
% 0.15/0.40 thf(func_def_0, type, emptyset: $i > $o).
% 0.15/0.40 thf(func_def_1, type, union: ($i > $o) > ($i > $o) > $i > $o).
% 0.15/0.40 thf(func_def_3, type, singleton: $i > $i > $o).
% 0.15/0.40 thf(func_def_5, type, sup: ($i > $o) > $i).
% 0.15/0.40 thf(func_def_6, type, supset: (($i > $o) > $o) > $i > $o).
% 0.15/0.40 thf(func_def_7, type, unionset: (($i > $o) > $o) > $i > $o).
% 0.15/0.40 thf(func_def_8, type, addition: $i > $i > $i).
% 0.15/0.40 thf(func_def_9, type, leq: $i > $i > $o).
% 0.15/0.40 thf(func_def_10, type, multiplication: $i > $i > $i).
% 0.15/0.40 thf(func_def_11, type, crossmult: ($i > $o) > ($i > $o) > $i > $o).
% 0.15/0.40 thf(func_def_29, type, ph3: !>[X0: $tType]:(X0)).
% 0.15/0.40 thf(func_def_30, type, sK4: $i > $i > $i).
% 0.15/0.40 thf(func_def_31, type, sK5: $i > $i > $i > $i).
% 0.15/0.40 thf(f133,plain,(
% 0.15/0.40 $false),
% 0.15/0.40 inference(avatar_sat_refutation,[],[f128,f130,f131])).
% 0.15/0.40 thf(f131,plain,(
% 0.15/0.40 ~spl2_2),
% 0.15/0.40 inference(avatar_split_clause,[],[f108,f125])).
% 0.15/0.40 thf(f125,plain,(
% 0.15/0.40 spl2_2 <=> (sK6 = sK1)),
% 0.15/0.40 introduced(avatar_definition,[new_symbols(naming,[spl2_2])])).
% 0.15/0.40 thf(f108,plain,(
% 0.15/0.40 (sK6 != sK1)),
% 0.15/0.40 inference(duplicate_literal_removal,[],[f107])).
% 0.15/0.40 thf(f107,plain,(
% 0.15/0.40 (sK6 != sK1) | (sK6 != sK1)),
% 0.15/0.40 inference(equality_proxy_clausification,[],[f104])).
% 0.15/0.40 thf(f104,plain,(
% 0.15/0.40 (sK6 != sK1) | ($false = (sK1 = sK6))),
% 0.15/0.40 inference(binary_proxy_clausification,[],[f103])).
% 0.15/0.40 thf(f103,plain,(
% 0.15/0.40 (((sK0 = sK6) | (sK1 = sK6)) = $false) | (sK6 != sK1)),
% 0.15/0.40 inference(equality_proxy_clausification,[],[f102])).
% 0.15/0.40 thf(f102,plain,(
% 0.15/0.40 ($false = (sK1 = sK6)) | (((sK0 = sK6) | (sK1 = sK6)) = $false)),
% 0.15/0.40 inference(binary_proxy_clausification,[],[f100])).
% 0.15/0.40 thf(f100,plain,(
% 0.15/0.40 (((sK1 = sK6) | (sK0 = sK6)) = $false) | (((sK0 = sK6) | (sK1 = sK6)) = $false)),
% 0.15/0.40 inference(binary_proxy_clausification,[],[f98])).
% 0.15/0.40 thf(f98,plain,(
% 0.15/0.40 (((sK0 = sK6) | (sK1 = sK6)) != ((sK1 = sK6) | (sK0 = sK6)))),
% 0.15/0.40 inference(beta_eta_normalization,[],[f97])).
% 0.15/0.40 thf(f97,plain,(
% 0.15/0.40 (((^[Y0 : $i]: ((sK1 = Y0) | (sK0 = Y0))) @ sK6) != ((^[Y0 : $i]: ((sK0 = Y0) | (sK1 = Y0))) @ sK6))),
% 0.15/0.40 inference(negative_extensionality,[],[f96])).
% 0.15/0.40 thf(f96,plain,(
% 0.15/0.40 ((^[Y0 : $i]: ((sK1 = Y0) | (sK0 = Y0))) != (^[Y0 : $i]: ((sK0 = Y0) | (sK1 = Y0))))),
% 0.15/0.40 inference(equality_resolution,[],[f64])).
% 0.15/0.40 thf(f64,plain,(
% 0.15/0.40 ((sup @ (^[Y0 : $i]: ((sK1 = Y0) | (sK0 = Y0)))) != (sup @ (^[Y0 : $i]: ((sK0 = Y0) | (sK1 = Y0)))))),
% 0.15/0.40 inference(beta_eta_normalization,[],[f60])).
% 0.15/0.40 thf(f60,plain,(
% 0.15/0.40 (((^[Y0 : $i]: ((^[Y1 : $i]: (sup @ ((^[Y2 : $i > $o]: ((^[Y3 : $i > $o]: ((^[Y4 : $i]: ((Y3 @ Y4) | (Y2 @ Y4))))))) @ ((^[Y2 : $i]: ((^[Y3 : $i]: (Y2 = Y3)))) @ Y0) @ ((^[Y2 : $i]: ((^[Y3 : $i]: (Y2 = Y3)))) @ Y1)))))) @ sK0 @ sK1) != ((^[Y0 : $i]: ((^[Y1 : $i]: (sup @ ((^[Y2 : $i > $o]: ((^[Y3 : $i > $o]: ((^[Y4 : $i]: ((Y3 @ Y4) | (Y2 @ Y4))))))) @ ((^[Y2 : $i]: ((^[Y3 : $i]: (Y2 = Y3)))) @ Y0) @ ((^[Y2 : $i]: ((^[Y3 : $i]: (Y2 = Y3)))) @ Y1)))))) @ sK1 @ sK0))),
% 0.15/0.40 inference(definition_unfolding,[],[f52,f55,f55])).
% 0.15/0.40 thf(f55,plain,(
% 0.15/0.40 (addition = (^[Y0 : $i]: ((^[Y1 : $i]: (sup @ ((^[Y2 : $i > $o]: ((^[Y3 : $i > $o]: ((^[Y4 : $i]: ((Y3 @ Y4) | (Y2 @ Y4))))))) @ ((^[Y2 : $i]: ((^[Y3 : $i]: (Y2 = Y3)))) @ Y0) @ ((^[Y2 : $i]: ((^[Y3 : $i]: (Y2 = Y3)))) @ Y1)))))))),
% 0.15/0.40 inference(definition_unfolding,[],[f51,f48,f41,f41])).
% 0.15/0.40 thf(f41,plain,(
% 0.15/0.40 (singleton = (^[Y0 : $i]: ((^[Y1 : $i]: (Y0 = Y1)))))),
% 0.15/0.40 inference(cnf_transformation,[],[f23])).
% 0.15/0.40 thf(f23,plain,(
% 0.15/0.40 (singleton = (^[Y0 : $i]: ((^[Y1 : $i]: (Y0 = Y1)))))),
% 0.15/0.40 inference(fool_elimination,[],[f22])).
% 0.15/0.40 thf(f22,plain,(
% 0.15/0.40 ((^[X0 : $i, X1 : $i] : ((X0 = X1))) = singleton)),
% 0.15/0.40 inference(rectify,[],[f3])).
% 0.15/0.40 thf(f3,axiom,(
% 0.15/0.40 ((^[X0 : $i, X2 : $i] : ((X0 = X2))) = singleton)),
% 0.15/0.40 file('/export/starexec/sandbox2/tmp/tmp.LDamrgVHn1/Vampire---4.8_24398',singleton_def)).
% 0.15/0.40 thf(f48,plain,(
% 0.15/0.40 (union = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((Y1 @ Y2) | (Y0 @ Y2))))))))),
% 0.15/0.40 inference(cnf_transformation,[],[f19])).
% 0.15/0.40 thf(f19,plain,(
% 0.15/0.40 (union = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((Y1 @ Y2) | (Y0 @ Y2))))))))),
% 0.15/0.40 inference(fool_elimination,[],[f18])).
% 0.15/0.40 thf(f18,plain,(
% 0.15/0.40 (union = (^[X0 : $i > $o, X1 : $i > $o, X2 : $i] : ((X0 @ X2) | (X1 @ X2))))),
% 0.15/0.40 inference(rectify,[],[f2])).
% 0.15/0.40 thf(f2,axiom,(
% 0.15/0.40 (union = (^[X0 : $i > $o, X1 : $i > $o, X2 : $i] : ((X0 @ X2) | (X1 @ X2))))),
% 0.15/0.40 file('/export/starexec/sandbox2/tmp/tmp.LDamrgVHn1/Vampire---4.8_24398',union_def)).
% 0.15/0.40 thf(f51,plain,(
% 0.15/0.40 (addition = (^[Y0 : $i]: ((^[Y1 : $i]: (sup @ (union @ (singleton @ Y0) @ (singleton @ Y1)))))))),
% 0.15/0.40 inference(cnf_transformation,[],[f29])).
% 0.15/0.40 thf(f29,plain,(
% 0.15/0.40 (addition = (^[Y0 : $i]: ((^[Y1 : $i]: (sup @ (union @ (singleton @ Y0) @ (singleton @ Y1)))))))),
% 0.15/0.40 inference(fool_elimination,[],[f9])).
% 0.15/0.40 thf(f9,axiom,(
% 0.15/0.40 (addition = (^[X0 : $i, X1 : $i] : (sup @ (union @ (singleton @ X0) @ (singleton @ X1)))))),
% 0.15/0.40 file('/export/starexec/sandbox2/tmp/tmp.LDamrgVHn1/Vampire---4.8_24398',addition_def)).
% 0.15/0.40 thf(f52,plain,(
% 0.15/0.40 ((addition @ sK1 @ sK0) != (addition @ sK0 @ sK1))),
% 0.15/0.40 inference(cnf_transformation,[],[f37])).
% 0.15/0.40 thf(f37,plain,(
% 0.15/0.40 ((addition @ sK1 @ sK0) != (addition @ sK0 @ sK1))),
% 0.15/0.40 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f34,f36])).
% 0.15/0.40 thf(f36,plain,(
% 0.15/0.40 ? [X0,X1] : ((addition @ X1 @ X0) != (addition @ X0 @ X1)) => ((addition @ sK1 @ sK0) != (addition @ sK0 @ sK1))),
% 0.15/0.40 introduced(choice_axiom,[])).
% 0.15/0.40 thf(f34,plain,(
% 0.15/0.40 ? [X0,X1] : ((addition @ X1 @ X0) != (addition @ X0 @ X1))),
% 0.15/0.40 inference(ennf_transformation,[],[f32])).
% 0.15/0.40 thf(f32,plain,(
% 0.15/0.40 ~! [X0,X1] : ((addition @ X1 @ X0) = (addition @ X0 @ X1))),
% 0.15/0.40 inference(rectify,[],[f16])).
% 0.15/0.40 thf(f16,negated_conjecture,(
% 0.15/0.40 ~! [X5,X4] : ((addition @ X4 @ X5) = (addition @ X5 @ X4))),
% 0.15/0.40 inference(negated_conjecture,[],[f15])).
% 0.15/0.40 thf(f15,conjecture,(
% 0.15/0.40 ! [X5,X4] : ((addition @ X4 @ X5) = (addition @ X5 @ X4))),
% 0.15/0.40 file('/export/starexec/sandbox2/tmp/tmp.LDamrgVHn1/Vampire---4.8_24398',addition_comm)).
% 0.15/0.40 thf(f130,plain,(
% 0.15/0.40 ~spl2_1),
% 0.15/0.40 inference(avatar_split_clause,[],[f113,f121])).
% 0.15/0.40 thf(f121,plain,(
% 0.15/0.40 spl2_1 <=> (sK0 = sK6)),
% 0.15/0.40 introduced(avatar_definition,[new_symbols(naming,[spl2_1])])).
% 0.15/0.40 thf(f113,plain,(
% 0.15/0.40 (sK0 != sK6)),
% 0.15/0.40 inference(duplicate_literal_removal,[],[f112])).
% 0.15/0.40 thf(f112,plain,(
% 0.15/0.40 (sK0 != sK6) | (sK0 != sK6)),
% 0.15/0.40 inference(equality_proxy_clausification,[],[f111])).
% 0.15/0.40 thf(f111,plain,(
% 0.15/0.40 (sK0 != sK6) | ($false = (sK0 = sK6))),
% 0.15/0.40 inference(binary_proxy_clausification,[],[f109])).
% 0.15/0.40 thf(f109,plain,(
% 0.15/0.40 (((sK0 = sK6) | (sK1 = sK6)) = $false) | (sK0 != sK6)),
% 0.15/0.40 inference(equality_proxy_clausification,[],[f101])).
% 0.15/0.40 thf(f101,plain,(
% 0.15/0.40 ($false = (sK0 = sK6)) | (((sK0 = sK6) | (sK1 = sK6)) = $false)),
% 0.15/0.40 inference(binary_proxy_clausification,[],[f100])).
% 0.15/0.40 thf(f128,plain,(
% 0.15/0.40 spl2_1 | spl2_2),
% 0.15/0.40 inference(avatar_split_clause,[],[f119,f125,f121])).
% 0.15/0.40 thf(f119,plain,(
% 0.15/0.40 (sK6 = sK1) | (sK0 = sK6)),
% 0.15/0.40 inference(equality_proxy_clausification,[],[f118])).
% 0.15/0.40 thf(f118,plain,(
% 0.15/0.40 (sK0 = sK6) | ((sK1 = sK6) = $true)),
% 0.15/0.40 inference(equality_proxy_clausification,[],[f117])).
% 0.15/0.40 thf(f117,plain,(
% 0.15/0.40 ((sK0 = sK6) = $true) | ((sK1 = sK6) = $true)),
% 0.15/0.40 inference(duplicate_literal_removal,[],[f116])).
% 0.15/0.40 thf(f116,plain,(
% 0.15/0.40 ((sK1 = sK6) = $true) | ((sK1 = sK6) = $true) | ((sK0 = sK6) = $true) | ((sK0 = sK6) = $true)),
% 0.15/0.40 inference(binary_proxy_clausification,[],[f115])).
% 0.15/0.40 thf(f115,plain,(
% 0.15/0.40 (((sK0 = sK6) | (sK1 = sK6)) = $true) | ((sK0 = sK6) = $true) | ((sK1 = sK6) = $true)),
% 0.15/0.40 inference(binary_proxy_clausification,[],[f99])).
% 0.15/0.40 thf(f99,plain,(
% 0.15/0.40 (((sK1 = sK6) | (sK0 = sK6)) = $true) | (((sK0 = sK6) | (sK1 = sK6)) = $true)),
% 0.15/0.40 inference(binary_proxy_clausification,[],[f98])).
% 0.15/0.40 % SZS output end Proof for Vampire---4
% 0.15/0.40 % (24575)------------------------------
% 0.15/0.40 % (24575)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.40 % (24575)Termination reason: Refutation
% 0.15/0.40
% 0.15/0.40 % (24575)Memory used [KB]: 5628
% 0.15/0.40 % (24575)Time elapsed: 0.015 s
% 0.15/0.40 % (24575)Instructions burned: 12 (million)
% 0.15/0.40 % (24575)------------------------------
% 0.15/0.40 % (24575)------------------------------
% 0.15/0.40 % (24568)Success in time 0.037 s
% 0.15/0.40 % Vampire---4.8 exiting
%------------------------------------------------------------------------------